Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem

نویسنده

  • Thomas Watson
چکیده

We study the lift-and-project procedures of Lovász-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with triangle inequality. For the asymmetric TSP tour problem, Charikar, Goemans, and Karloff (FOCS 2004) proved that the integrality gap of the standard relaxation is at least 2. We prove that after one round of the Lovász-Schrijver or Sherali-Adams procedures, the integrality gap of the asymmetric TSP tour problem is at least 3/2, with a caveat on which version of the standard relaxation is used. For the symmetric TSP tour problem, the integrality gap of the standard relaxation is known to be at least 4/3, and Cheung (SIOPT 2005) proved that it remains at least 4/3 after o(n) rounds of the Lovász-Schrijver procedure, where n is the number of nodes. For the symmetric TSP path problem, the integrality gap of the standard relaxation is known to be at least 3/2, and we prove that it remains at least 3/2 after o(n) rounds of the Lovász-Schrijver procedure, by a simple reduction to Cheung’s result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Integrality Gap for Asymmetric TSP Paths

The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V, d) with specified vertices s and t, the goal is to find an s-t path of minimum length that visits all the vertices in V . This problem is closely related to the Asymmetric TSP (ATSP) problem, which seeks to find a tour (instead of an s-t path) visiting all the nodes: for ATSP, a ρ-approx...

متن کامل

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods

Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set Cover problem with approximation ratios better than lnn. In light of this result, it is natural to ask whether such improvements can be achieved using lift-andproject methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algo...

متن کامل

An LP 7/4-approximation for the Tree Augmentation Problem

In the Tree Augmentation Problem (TAP) the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪ F is 2-edge-connected. The best known approximation ratio for the problem is 1.5 [5, 12]. Several paper analysed integrality gaps of LP and SDP relaxations for the problem. In [13] is given a simple LP with gap 1.5 for the case when every edge in E connects t...

متن کامل

Integrality Gaps for Bounded Color Matchings

We investigate the performance of two common lift-and-project techniques, the SheraliAdams (SA) and the Balas, Ceria and Cornuéjols (BCC) hierarchies, on the natural linear relaxation of the Bounded Color Matching polyhedron and generalizations. We prove the following unconditional inapproximability results: even a large family of linear programs, generated by an asymptotically linear number of...

متن کامل

Humanlike Problem Solving in the Context of the Traveling Salesperson Problem

Computationally hard problems, like the Traveling Salesperson Problem, can be solved remarkably well by humans. Results obtained by computers are usually closer to the optimum, but require high computational effort and often differ from the human solutions. This paper introduces Greedy Expert Search (GES) that strives to show the same flexibility and efficiency of human solutions, while produci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2011